Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
نویسندگان
چکیده
منابع مشابه
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good performance. The theoretical analysis of these algorithms usually focuses on convergence rates. This paper presents a mathematical study of randomized search heuristics which use comparison based selection mechanism. The ...
متن کاملWhen are Distributed Algorithms Robust?
In recent years, numerous distributed algorithms have been proposed which, when executed by a team of dynamic agents, result in the completion of a joint task. However, for any such algorithm to be practical, one should be able to guarantee that the task is still satisfactorily executed even when agents fail to communicate with others or to perform their designated actions correctly. In this pa...
متن کاملForward Constraint-Based Algorithms for Anytime Planning
This paper presents a generic anytime forward-search constraint-based algorithm for solving planning problems expressed in the CNT framework (Constraint Network on Timelines). It is generic because it allows many kinds of search to be covered, from complete tree search to greedy search. It is anytime because some parameter settings, together with domain-specific knowledge, allow high quality pl...
متن کاملRandomized Algorithms for Comparison-based Search
This paper addresses the problem of finding the nearest neighbor (or one of the R-nearest neighbors) of a query object q in a database of n objects, when we can only use a comparison oracle. The comparison oracle, given two reference objects and a query object, returns the reference object most similar to the query object. The main problem we study is how to search the database for the nearest ...
متن کاملOptimal Randomized Comparison Based Algorithms for Collision
We consider the well known problem of finding two identical elements, called a collision, in a list of n numbers. Here, the (very fast) comparison based algorithms are randomized and will only report existing collisions, and do this with (small) probability p, the success probability. We find a trade-off between p and the running time t, and show that this trade-off is optimal up to a constant ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolutionary Computation
سال: 2007
ISSN: 1063-6560,1530-9304
DOI: 10.1162/evco.2007.15.4.411